The SCMPDS Computer and the Basic Semantics of its Instructions

نویسنده

  • Jing-Chao Chen
چکیده

The article defines the SCMPDS computer and its instructions. The SCMPDS computer consists of such instructions as conventional arithmetic, ”goto”, ”return” and ”save instruction-counter” (”saveIC” for short). The address used in the ”goto” instruction is an offset value rather than a pointer in the standard sense. Thus, we don’t define halting instruction directly but define it by ”goto 0” instruction. The ”saveIC” and ”return” equal almost call and return statements in the usual high programming language. Theoretically, the SCMPDS computer can implement all algorithms described by the usual high programming language including recursive routine. In addition, we describe the execution semantics and halting properties of each instruction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The SCMPDS Computer and the Basic Semantics of its Instructions1

The article defines the SCMPDS computer and its instructions. The SCMPDS computer consists of such instructions as conventional arithmetic, “goto”, “return” and “save instruction-counter” (“saveIC” for short). The address used in the “goto” instruction is an offset value rather than a pointer in the standard sense. Thus, we don’t define halting instruction directly but define it by “goto 0” ins...

متن کامل

Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey

One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...

متن کامل

Computation and Program Shift in the SCMPDS Computer1

A finite partial state is said to be autonomic if the computation results in any two states containing it are same on its domain. On the basis of this definition, this article presents some computation results about autonomic finite partial states of the SCMPDS computer. Because the instructions of the SCMPDS computer are more complicated than those of the SCMFSA computer, the results given by ...

متن کامل

Computation and Program Shift in the SCMPDS Computer

A finite partial state is said to be autonomic if the computation results in any two states containing it are same on its domain. On the basis of this definition, this article presents some computation results about autonomic finite partial states of the SCMPDS computer. Because the instructions of the SCMPDS computer are more complicated than those of the SCMFSA computer, the results given by ...

متن کامل

Insert Sort on Scmpds

The goal of this article is to examine the effectiveness of “forloop” and “while-loop” statements on SCMPDS by insert sort. In this article, first of all, we present an approach to compute the execution result of “for-loop” program by “loop-invariant”, based on Hoare’s axioms for program verification. Secondly, we extend the fundamental properties of the finite sequence and complex instructions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007